Compact linear programs for 2SAT
نویسندگان
چکیده
For each integer n we present an explicit formulation of a compact linear program, with O(n) variables and constraints, which determines the satisfiability of any 2SAT formula with n boolean variables by a single linear optimization. This contrasts with the fact that the natural polytope for this problem, formed from the convex hull of all satisfiable formulas and their satisfying assignments, has superpolynomial extension complexity. Our formulation is based on multicommodity flows. We also discuss connections of these results to the stable matching problem.
منابع مشابه
On solving Boolean combinations of generalized 2SAT constraints
" is the maximum over the absolute values of constants appearing in the constraints. This solution bound improves over previously obtained bounds by an exponential factor. Our result enables a new enumerative approach to satisfiability checking. An experimental evaluation demonstrates the efficiency of this approach over previous techniques. As a corollary of our main result, we obtain a polyno...
متن کاملAverage-Case Analysis for the MAX-2SAT Problem
We propose a simple probability model for MAX-2SAT instances for discussing the average-case complexity of the MAX-2SAT problem. Our model is a “planted solution model”, where each instance is generated randomly from a target solution. We show that for a large range of parameters, the planted solution (more precisely, one of the planted solution pair) is the optimal solution for the generated i...
متن کاملAproximating the Value of Two Prover Proof Systems, With Applications to MAX 2SAT and MAX DICUT
It is well known that two prover proof systems are a convenient tool for establishing hardness of approximation results. In this paper, we show that two prover proof systems are also convenient starting points for establishing easiness of approximation results. Our approach combines the Feige-Lovv asz (STOC92) semideenite programming relaxation of one-round two-prover proof systems, together wi...
متن کاملA Note for Parametric Complexity of #2SAT
We present some results about the parametric complexity for counting the number of truth assignments for two Conjunctive Forms (2CF’s), such problem is denoted as #2SAT. It is common to analyze the computational complexity for #2SAT regarding the number of variables or the number of clauses on the input formula F We consider here, the time complexity analysis for #2SAT based on a positive integ...
متن کاملEmbedding normed linear spaces into $C(X)$
It is well known that every (real or complex) normed linear space $L$ is isometrically embeddable into $C(X)$ for some compact Hausdorff space $X$. Here $X$ is the closed unit ball of $L^*$ (the set of all continuous scalar-valued linear mappings on $L$) endowed with the weak$^*$ topology, which is compact by the Banach--Alaoglu theorem. We prove that the compact Hausdorff space $X$ can ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1702.06723 شماره
صفحات -
تاریخ انتشار 2017